Related-Key Differential Attacks on Reduced-Round LBlock

نویسندگان

چکیده

LBlock, as one of the typical lightweight encryption schemes, is a 32-round block cipher with 64 bit and 80 master key. It can be widely applied in IoT environment because its friendly software hardware implementations. Since it came out, has encountered many attacks. In this paper, we evaluate LBlock’s ability against related-key differential attack more accurately based on SMT method. On hand, propose tighter lower bounds minimal number active S-boxes for up to 19 rounds which are 8 than previous ones. Then, upper total probabilities LBlock first time. other suitable 17-round distinguisher, attacks 22- 23-round LBlock. Each these time complexity data ones same

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Related-Key Impossible Differential Attacks on Reduced-Round AES-256

In this paper we examine the strength of AES-256 against the related-key impossible differential attack, following the work in [1] and [2]. Firstly, we present a carefully chosen relation between the related keys, which can be extended to 8-round(even more rounds) subkey differences. Then, we construct a 5.5-round related-key impossible differential. Using the differential, we present an attack...

متن کامل

Improved Impossible Differential Attacks against Round-Reduced LBlock

Impossible differential attacks are among the most powerful forms of cryptanalysis against block ciphers. We present in this paper an in-depth complexity analysis of these attacks. We show an unified way to mount such attacks and provide generic formulas for estimating their time and data complexities. LBlock is a well studied lightweight block cipher with respect to impossible differential att...

متن کامل

Related Key Attacks on Reduced Round KASUMI

This paper describes related key attacks on five and six round KASUMI. The five round attack requires the encryption of approximately 2 chosen plaintext pairs X and X∗ under keys K and K∗ respectively where K and K∗ differ in only one bit, and requires a maximum of a little over 2 trials to recover the entire key. The six round attack requires a smaller number of chosen plaintext encryptions th...

متن کامل

Impossible Differential Cryptanalysis of Reduced-Round LBlock

In this paper, we improve the impossible differential attack on 20-round LBlock given in the design paper of the LBlock cipher. Using relations between the round keys we attack on 21-round and 22-round LBlock with a complexity of 2 and 2 encryptions respectively. We use the same 14-round impossible differential characteristic observed by the designers to attack on 21 rounds and another 14-round...

متن کامل

Truncated differential based known-key attacks on round-reduced SIMON

At Crypto 2015, Blondeau, Peyrin and Wang proposed a truncated-differential-based known-key attack on full PRESENT, a nibble oriented lightweight blockcipher with a SPN structure. The truncated difference they used is derived from the existing multidimensional linear characteristics. An innovative technique of their work is the design of a MITM layer added before the characteristic that covers ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Security and Communication Networks

سال: 2022

ISSN: ['1939-0122', '1939-0114']

DOI: https://doi.org/10.1155/2022/8464960